Common Agency and Coordinated Bids in Sponsored Search Auctions

نویسندگان

  • Francesco Decarolis
  • Maris Goldmanis
  • Antonio Penta
  • Ken Hendricks
  • Jon Levin
  • Gregory Lewis
  • Bart Lipman
  • Massimo Motta
  • Dilip Mookherjee
  • Paul Oka
چکیده

The transition of the advertisement market from traditional media to the internet has induced a proliferation of marketing agencies specialized in bidding in the auctions used to sell advertisement space on the web. We analyze how bidding delegation to a common marketing agency undermines both revenues and efficiency of the generalized second price auction, the format used by Google and Microsoft-Yahoo!. We characterize losses relative to the case of both full competition and agency-coordination under an alternative auction format (VCG mechanism). We propose a criterion to detect bid coordination and apply it to data from a major search engine.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equilibrium Bids in Sponsored Search Auctions: Theory and Evidence Article (accepted Version) (refereed) Equilibrium Bids in Sponsored Search Auctions: Theory and Evidence *

This paper presents a game theoretic analysis of the generalized second price auction that the company Overture operated in 2004 to sell sponsored search listings on search engines. We construct a model that embodies few prior assumptions about parameters, and we present results that indicate that this model has under quite general assumptions a multiplicity of Nash equilibria. We then analyze ...

متن کامل

Exclusive Display in Sponsored Search Advertising

As sponsored search becomes increasingly important as an advertising medium for firms, search engines are exploring more advanced bidding and ranking mechanisms to increase their revenue from sponsored search auctions. For instance, Google, Yahoo! and Bing are investigating auction mechanisms in which each advertiser submits two bids: one bid for the standard display format in which multiple ad...

متن کامل

Simplified Mechanisms with Applications to Sponsored Search and Package Auctions

Simplified Mechanisms with Applications to Sponsored Search and Package Auctions Paul Milgrom First draft: August 16, 2007 This draft: October 13, 2007 A simplified mechanism is a direct mechanism modified by restricting the set of reports or bids. An example is the auction used to place ads on Internet search pages, in which each advertiser bids a single price to determine the allocation of ei...

متن کامل

An Empirical Examination of the Relation between Bids and Positions of Ads in Sponsored Search

The rapid growth of e-business in the last years made sponsored search a multi-billion dollar industry, which will continue to grow in the upcoming years. Approximately 50% of the total online advertising spending today is used for sponsored search, where search engine providers use sponsored search auctions for pricing the clicks and ranking the ads based on the bids advertisers submit for a s...

متن کامل

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015